Algebraic study of the Apollonius circle of three ellipses
نویسندگان
چکیده
We study the external tritangent Apollonius (or Voronoi) circle to three ellipses. This problem arises when one wishes to compute the Apollonius (or Voronoi) diagram of a set of ellipses, but is also of independent interest in enumerative geometry. This paper is restricted to non-intersecting ellipses, but the extension to arbitrary ellipses is possible. We propose an efficient representation of the distance between a point and an ellipse by considering a parametric circle tangent to an ellipse. The distance of its center to the ellipse is expressed by requiring that their characteristic polynomial have at least one multiple real root. We study the complexity of the tritangent Apollonius circle problem, using the above representation for the distance, as well as sparse (or toric) elimination. We offer the first nontrivial upper bound on the number of tritangent circles, namely 184.
منابع مشابه
A TAXICAB VERSION OF A TRIANGLE' S APOLLONIUS CIRCLE
One of the most famous problems of classical geometry is the Apollonius' problem asks construction of a circle which is tangent to three given objects. These objects are usually taken as points, lines, and circles. This well known problem was posed by Apollonius of Perga ( about 262 - 190 B.C.) who was a Greek mathematician known as the great geometer of ancient times after Euclid and Archimede...
متن کاملACS Algorithms for Complex Shapes with Certified Numerics and Topology Voronoi diagram of ellipses: cgal-based implementation
We present a C++ open-source implementation of an incremental algorithm for the computation of the Voronoi diagram of ellipses in the Euclidean plane. This is the first complete implementation, under the exact computation paradigm; it also computes the approximate diagram with any given precision. It is based on the cgal package for the Apollonius diagram. The ellipses are given in parametric r...
متن کاملA cgal-based implementation for the Voronoi diagram of ellipses
We present a C++ open-source implementation of an incremental algorithm for the computation of the Voronoi diagram of ellipses in the Euclidean plane. This is the first complete implementation, under the exact computation paradigm, for the given problem. It is based on the cgal package for the Apollonius diagram in the plane: exploiting the generic programming principle, our main additions conc...
متن کاملAnother Solution of Apollonius Tenth Problem
We provide a new solution for the famous Apollonius Tenth Problem. The problem is to construct a circle tangent to three given circles in the plane. An equivalence between analytical and geometric approaches to the solution is explored. A new analytical solution for the problem is presented and a step by step geometrical interpretation of this solution is provided. We show that this interpretat...
متن کاملOn Three Circles
Abstract. The classical Three-Circle Problem of Apollonius requires the construction of a fourth circle tangent to three given circles in the Euclidean plane. For circles in general position this may admit as many as eight solutions or even no solutions at all. Clearly, an “experimental” approach is unlikely to solve the problem, but, surprisingly, it leads to a more general theorem. Here we co...
متن کامل